package aqiyi;

import java.util.Scanner;

/**
 * @author habitplus
 * @since 2021-08-22 16:25
 */
public class T1 {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();
        handle(n);
    }

    private static void handle(int n) {
        if (n < 1) {
            System.out.println("");
        }
        int[][] q = new int[n][n];
        // 枚举第一个皇后的放置位置
        for (int i = 0; i < n; i++) {
            q[0][i] = 1;
            queen(q, 0, i, 0, n);
            q[0][i] = 0;
        }
    }

    private static void queen(int[][] q, int x, int y, int k, int n) {
        if (k == n) {
            // 全部放置完毕

        }
    }
}
